An Update-Based Maximum Column Distance Coding Scheme for Index Coding

In this paper, we propose a new scalar linear coding scheme for the index problem called update-based maximum column distance (UMCD) scheme. The central idea in each transmission is to code messages such that one of receivers with minimum size side information instantaneously eliminated from unsatisfied receivers. One main contribution paper prove other satisfied can be identified after transmission, using polynomial-time algorithm solving well-known cardinality matching graph theory. This leads determining total number transmissions without knowing coefficients. Once and what transmit round are found, then method determine all coefficients sufficiently large finite field. We provide concrete instances where proposed UMCD has better broadcast performance compared most efficient existing schemes, including recursive (Arbabjolfaei Kim, 2014) interlinked-cycle cover (ICC) (Thapa et al. , 2017). performs at least as well MDS terms rate. By characterizing two classes instances, show gap between rates ICC schemes grows linearly messages. Then, extend its vector version by applying it basic block solve subinstances.